|
|
Diagnosing Errors inside Computer Networks Based on the Typo Errors
Bohuš, Michal ; Ryšavý, Ondřej (referee) ; Holkovič, Martin (advisor)
The goal of this diploma thesis is to create system for network data diagnostics based on detecting and correcting spelling errors. The system is intended to be used by network administrators as next diagnostics tool. As opposed to the primary use of detection and correction spelling error in common text, these methods are applied to network data, which are given by the user. Created system works with NetFlow data, pcap files or log files. Context is modeled with different created data categories. Dictionaries are used to verify the correctness of words, where each category uses its own. Finding a correction only according to the edit distance leads to many results and therefore a heuristic for evaluating candidates was proposed for selecting the right candidate. The created system was tested in terms of functionality and performance.
|
|
|
Hardware Acceleration of Algorithms for Approximate String Matching
Nosek, Ondřej ; Kořenek, Jan (referee) ; Martínek, Tomáš (advisor)
Methods for aproximate string matching of various sequences used in bioinformatics are crucial part of development in this branch. Tasks are of very large time complexity and therefore we want create a hardware platform for acceleration of these computations. Goal of this work is to design a generalized architecture based on FPGA technology, which can work with various types of sequences. Designed acceleration card will use especially dynamic algorithms like Needleman-Wunsch and Smith-Waterman.
|
|
|
Searching repetitive DNA in nucleotide sequences
Moskovská, Kateřina ; Provazník, Ivo (referee) ; Kubicová, Vladimíra (advisor)
This bachelor thesis deals with problem of repetitive DNA and algorithms for searching tandem repeats. Tandem repeats are important for biological industry. They are used as gene marker for creating genetic maps, profiles of DNA for paternity testing and in forensic sphere. Tandem repeats wreak several sever humen illness and it is another reason for their searching. Therefore are algorithms for searching of tandem repeats objects of many studies. We can divided algorithms to two main groups – algorithms based on string matching and algorithms based on digital signal processing. Task of this bachelor thesis is choose one member of each group and propose their implementation and than implement them in program Matlab. Result of this thesis should be comparison both programs. This comparison pass off on the basis of chosen criterion and several sequences. Both program transform these sequences and than can be programs compare.
|
|
|
Diagnosing Errors inside Computer Networks Based on the Typo Errors
Bohuš, Michal ; Ryšavý, Ondřej (referee) ; Holkovič, Martin (advisor)
The goal of this diploma thesis is to create system for network data diagnostics based on detecting and correcting spelling errors. The system is intended to be used by network administrators as next diagnostics tool. As opposed to the primary use of detection and correction spelling error in common text, these methods are applied to network data, which are given by the user. Created system works with NetFlow data, pcap files or log files. Context is modeled with different created data categories. Dictionaries are used to verify the correctness of words, where each category uses its own. Finding a correction only according to the edit distance leads to many results and therefore a heuristic for evaluating candidates was proposed for selecting the right candidate. The created system was tested in terms of functionality and performance.
|
|
|
Searching repetitive DNA in nucleotide sequences
Moskovská, Kateřina ; Provazník, Ivo (referee) ; Kubicová, Vladimíra (advisor)
This bachelor thesis deals with problem of repetitive DNA and algorithms for searching tandem repeats. Tandem repeats are important for biological industry. They are used as gene marker for creating genetic maps, profiles of DNA for paternity testing and in forensic sphere. Tandem repeats wreak several sever humen illness and it is another reason for their searching. Therefore are algorithms for searching of tandem repeats objects of many studies. We can divided algorithms to two main groups – algorithms based on string matching and algorithms based on digital signal processing. Task of this bachelor thesis is choose one member of each group and propose their implementation and than implement them in program Matlab. Result of this thesis should be comparison both programs. This comparison pass off on the basis of chosen criterion and several sequences. Both program transform these sequences and than can be programs compare.
|
|
|
Hardware Acceleration of Algorithms for Approximate String Matching
Nosek, Ondřej ; Kořenek, Jan (referee) ; Martínek, Tomáš (advisor)
Methods for aproximate string matching of various sequences used in bioinformatics are crucial part of development in this branch. Tasks are of very large time complexity and therefore we want create a hardware platform for acceleration of these computations. Goal of this work is to design a generalized architecture based on FPGA technology, which can work with various types of sequences. Designed acceleration card will use especially dynamic algorithms like Needleman-Wunsch and Smith-Waterman.
|
guest ::
